Partial order and indecomposability

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Periodicity and Indecomposability

In this paper we characterize the existence of periodic points of odd period greater than one for unimodal mappings of an interval onto itself. The interesting juxtaposition of this condition with the occurrence in inverse limits of the well-known Brouwer-Janiszewski-Knaster continuum is explored. Also obtained is a characterization of indecomposability of certain inverse limits using a single ...

متن کامل

Economic order quantity with partial backordering and sampling inspection

To access the efficient inventory system, managers should consider all the situations that have happened in reality. One of these situations is the presence of the defective items in each received lot and the other situation is being the group of customers that do not wait to fulfill their requirements from the vendor and choose another one to get their orders so the proportion of the backorder...

متن کامل

Indecomposability Graphs of Rings

We define a subgraph of the zero divisor graph of a ring, associated to the ring idempotents. We study its properties and prove that for large classes of rings the connectedness of the graph is equivalent to the indecomposability of the ring and in those cases we also calculate the graph’s diameter. 2000 Mathematics subject classification: 16U99, 05C99.

متن کامل

On indecomposability and composants of chaotic continua

A homeomorphism f : X → X of a compactum X with metric d is expansive if there is c > 0 such that if x, y ∈ X and x 6= y, then there is an integer n ∈ Z such that d(fn(x), fn(y)) > c. A homeomorphism f : X → X is continuum-wise expansive if there is c > 0 such that if A is a nondegenerate subcontinuum of X, then there is an integer n ∈ Z such that diam fn(A) > c. Clearly, every expansive homeom...

متن کامل

Partial Order

Ginsberg has recently introduced a polynomial space aggressive dependency directed backtrack search technique. Aggressive dependency directed techniques have the property that the size of the search space generated by a union of disjoint subproblems is proportional to the sum of the search space generated by each problem independently. Earlier polynomial space dependency directed methods did no...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 1954

ISSN: 0002-9939

DOI: 10.1090/s0002-9939-1954-0064391-8